#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL fac[12];
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    for(LL i=1;i<=10;i++){
        int num=1;
        for(LL j=1;j<=i;j++){
            num*=j;
        }
        fac[i]=num;
    }
//    for(LL i=1;i<=10;i++){
//        cout<<fac[i]<<" ";
//    }
//    cout<<"\n";
    LL p;cin>>p;
    LL ans=0;
    for(LL i=10;i>=1;i--){
        while(p>=fac[i]){
            p-=fac[i];
            ans++;
        }
    }
    cout<<ans<<"\n";
   	return 0;
}
